Average performance of greedy heuristics for the integer knapsack problem
نویسندگان
چکیده
This paper derives a lower bound on the average performance of a total-value greedy heuristic for the integer knapsack problem. This heuristic selects items in order of their maximum possible contribution to the solution value at each stage. We show that, as for the worst-case bound, the average performance bound for the total-value heuristic dominates the corresponding bound for the density-ordered greedy heuristic. 2002 Elsevier B.V. All rights reserved.
منابع مشابه
Joint Performance of Greedy Heuristics for the Integer Knapsack Problem
This paper analyzes the worst-case performance of combinations of greedy heuristics for the integer knapsack problem. If the knapsack is large enough to accomodate at least m units of any item, then the joint performance of the total-value and density-ordered greedy heuristics is no smaller than (m + l)/(m + 2). For combinations of greedy heuristics that do not involve both the density-ordered ...
متن کاملThe Batch Loading and Scheduling Problem
This paper discusses a problem that commonly occurs in the batching and schedulingof certainkinds of batch processors. Examplesof these processors include heat treatment facilities, particularly in the steeland ceramicindustries as well as a varietyof operations in the manufacture of integratedcircuits. There are a set of jobs waiting to be processed. The processing time for a batchdependsonly ...
متن کاملDetecting communities of workforces for the multi-skill resource-constrained project scheduling problem: A dandelion solution approach
This paper proposes a new mixed-integer model for the multi-skill resource-constrained project scheduling problem (MSRCPSP). The interactions between workers are represented as undirected networks. Therefore, for each required skill, an undirected network is formed which shows the relations of human resources. In this paper, community detection in networks is used to find the most compatible wo...
متن کاملThe Subset Sum game☆
In this work we address a game theoretic variant of the Subset Sum problem, in which two decision makers (agents/players) compete for the usage of a common resource represented by a knapsack capacity. Each agent owns a set of integer weighted items and wants to maximize the total weight of its own items included in the knapsack. The solution is built as follows: Each agent, in turn, selects one...
متن کاملA matheuristic for the liner shipping network design problem
We present a matheuristic, an integer programming based heuristic, for the Liner Shipping Network Design Problem. The heuristic applies a greedy construction heuristic based on an interpretation of the liner shipping network design problem as a multiple quadratic knapsack problem. The construction heuristic is combined with an improvement heuristic with a neighborhood defined by the solution sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 154 شماره
صفحات -
تاریخ انتشار 2004